Nominal Unification and Matching of Higher Order Expressions with Recursive Let
نویسندگان
چکیده
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, shown to run in nondeterministic polynomial time. We also explore specializations like letrec-matching expressions, DAGs, garbage-free determine their complexity. provide atom-variables, where we show that it runs In addition prove there guessing strategy letrec atom-variable trade-off between exponential growth non-determinism. Nominal matching variables representing partial letrec-environments be NP.
منابع مشابه
Nominal Unification of Higher Order Expressions with Recursive Let
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine their complexity.
متن کاملNominal Unification of Higher Order Expressions with Recursive Let
Resum A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in nondeterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine the complexity of corresponding unification problems. URL https://doi.org/10.1007/978-3-319-63139-4_19 [5] DO...
متن کاملRelating Nominal and Higher-Order Pattern Unification
Higher-order pattern unification and nominal unification are two approaches to unifying modulo some form of α-equivalence (consistent renaming of bound names). Though the higher-order and nominal approaches superficially dissimilar, there is a natural concretion (or name-application) operation for nominal terms that can be used to simulate the behavior of higher-order patterns. We describe a fo...
متن کاملNominal Unification from a Higher-Order Perspective
Nominal logic is an extension of first-order logic with equality, namebinding, renaming via name-swapping and freshness of names. Contrarily to lambda-terms, in nominal terms, bindable names, called atoms, and instantiable variables are considered as distinct entities. Moreover, atoms are capturable by instantiations, breaking a fundamental principle of the lambda-calculus. Despite these differ...
متن کاملA Nominal Unification from a Higher-Order Perspective
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-swapping and freshness of names. Contrarily to lambda-terms, in nominal terms, bindable names, called atoms, and instantiable variables are considered as distinct entities. Moreover, atoms are capturable by instantiations, breaking a fundamental principle of the lambda-calculus. Despite these diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2022
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-222110